package com.leetcode.August;

/**
 * @Description: 240. 搜索二维矩阵 II
 * @Author: Mr.Fxy
 * @CreateTime: 2024-08-07 11:24
 */
public class LC240搜索二维矩阵II {
    public boolean searchMatrix(int[][] matrix, int target) {
        int wa = matrix.length;
        int ne = matrix[0].length;
        for (int i = 0; i < wa; i++) {
            for (int j = 0; j < ne; j++) {
                if (matrix[i][j] == target)return true;
            }
        }
        return false;
    }
}
